Lowness for Bounded Randomness Rod Downey and Keng
نویسندگان
چکیده
In [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore the lowness notions associated with these randomness notions. While these bounded notions seem far from classical notions with infinite tests like Martin-Löf and Demuth randomness, the lowness notions associated with bounded randomness turn out to be intertwined with the lowness notions for these two concepts. In fact, in one case, we get a new and likely very useful characterization of
منابع مشابه
Lowness for Computable Machines
Two lowness notions in the setting of Schnorr randomness have been studied (lowness for Schnorr randomness and tests, by Terwijn and Zambella [19], and by Kjos-Hanssen, Stephan, and Nies [7]; and Schnorr triviality, by Downey, Griffiths and LaForte [3, 4] and Franklin [6]). We introduce lowness for computable machines, which by results of Downey and Griffiths [3] is an analog of lowness for K. ...
متن کاملLowness for Demuth Randomness
We show that every real low for Demuth randomness is of hyperimmune-free degree.
متن کاملK-trivial Degrees and the Jump-traceability Hierarchy
For every order h such that P n 1/h(n) is finite, every K-trivial degree is h-jump-traceable. This motivated Cholak, Downey and Greenberg [2] to ask whether this traceability property is actually equivalent to K-triviality, thereby giving the hoped for combinatorial characterisation of lowness for Martin-Löf randomness. We show however that the K-trivial degrees are properly contained in those ...
متن کاملThema Algorithmic Randomness
We consider algorithmic randomness in the Cantor space C of the infinite binary sequences. By an algorithmic randomness concept one specifies a set of elements of C, each of which is assigned the property of being random. Miscellaneous notions from computability theory are used in the definitions of randomness concepts that are essentially rooted in the following three intuitive randomness requ...
متن کاملThe Sixth Lecture on Algorithmic Randomness∗
This paper follows on from the author’s Five Lectures on Algorithmic Randomness. It is concerned with material not found in that long paper, concentrating on Martin-Löf lowness and triviality. We present a hopefully user-friendly account of the decanter method, and discuss recent results of the author with Peter Cholak and Noam Greenberg concerning the class of strongly jump traceable reals int...
متن کامل